ar X iv : m at h - ph / 0 21 00 07 v 2 9 A pr 2 00 4 Quantum Algorithm Uncertainty Principles 215 QUANTUM ALGORITHM UNCERTAINTY PRINCIPLES

نویسنده

  • Ken Loo
چکیده

Abstract. Previously, Bennet and Feynman asked if Heisenberg’s uncertainty principle puts a limitation on a quantum computer (Quantum Mechanical Computers, Richard P. Feynman, Foundations of Physics, Vol. 16, No. 6, p597-531, 1986). Feynman’s answer was negative. In this paper, we will revisit the same question for the discrete time Fourier transform uncertainty principle. We will show that the discrete time Fourier transform uncertainty principle plays a fundamental role in showing that Shor’s type of quantum algorithms has efficient running time and conclude that the discrete time uncertainty principle is an aid in our current formulation and understanding of Shor’s type of quantum algorithms. It turns out that for these algorithms, the probability of measuring an element in some set T (at the end of the algorithm) can be written in terms of the time-limiting and band-limiting operators from finite Fourier analysis. Associated with these operators is the finite Fourier transform uncertainty principle. The uncertainty principle provides a lower bound for the above probability. We will derive lower bounds for these types of probabilities in general. We will call these lower bounds quantum algorithm uncertainty principles or QAUP. QAUP are important because they give us some sense of the probability of measuring something desirable. We will use these lower bounds to derive Shor’s factoring and discrete log algorithms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ar X iv : 0 70 4 . 12 77 v 1 [ qu an t - ph ] 1 0 A pr 2 00 7 DISCRETE PHASE SPACE AND MINIMUM - UNCERTAINTY STATES

The quantum state of a system of n qubits can be represented by a Wigner function on a discrete phase space, each axis of the phase space taking values in the finite field F 2 n. Within this framework, we show that one can make sense of the notion of a " rotationally invariant state " of any collection of qubits, and that any such state is, in a well defined sense, a state of minimum uncertainty.

متن کامل

ar X iv : m at h / 06 02 44 0 v 2 [ m at h . C A ] 9 J an 2 00 7 Completeness , special functions and uncertainty principles over q - linear grids

We derive completeness criteria for sequences of functions of the form f(xλn), where λn is the nth zero of a suitably chosen entire function. Using these criteria, we construct complete nonorthogonal systems of FourierBessel functions and their q-analogues, as well as other complete sets of qspecial functions. We discuss connections with uncertainty principles over q-linear grids and the comple...

متن کامل

ar X iv : q ua nt - p h / 05 10 06 9 v 1 1 0 O ct 2 00 5 Uncertainty Principle and the Standard Quantum Limits ∗

The role of the Uncertainty Principle is examined through the examples of squeezing, information capacity, and position monitoring. It is suggested that more attention should be directed to conceptual considerations in quantum information science and technology.

متن کامل

ar X iv : 0 80 4 . 31 43 v 1 [ m at h . A G ] 1 9 A pr 2 00 8 RUAN ’ S CONJECTURE ON SINGULAR SYMPLECTIC FLOPS

We prove that the orbifold quantum ring is preserved under singular symplectic flops. Hence we verify Ruan’s conjecture for this case.

متن کامل

ar X iv : 0 70 7 . 11 47 v 2 [ m at h - ph ] 1 1 O ct 2 00 7 Uncertainty principle with quantum Fisher information ∗

In this paper we prove a nontrivial lower bound for the determinant of the covariance matrix of quantum mechanical observables, which was conjectured by Gibilisco, Isola and Imparato. The lower bound is given in terms of the commutator of the state and the observables and their scalar product, which is generated by an arbitrary symmetric operator monotone function. Introduction The basic object...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004